Properties of optimal survivable paths in a graph
نویسندگان
چکیده
منابع مشابه
On Properties of Working Paths in Optimal Set of Survivable Paths
A survivable path (W,P ) between a pair of vertices xi, xj in undirected simple graph G is an ordered pair of edge-disjoint simple paths consisting of a working path W = xi...xj and a protection path P = xi...xj . An optimal set of survivable paths in graph G corresponds to a set of mesh-restored lightpaths defined on an optical network that minimizes the number of used optical channels. In thi...
متن کاملAnalysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks
In this work we introduce and describe optimal sets of survivable paths defined on an undirected simple graph G. An optimal set of survivable paths in G corresponds to a set of mesh-restored lightpaths in an optical network that minimizes the number of optical channels. We present several fundamental properties of optimal sets of survivable paths in G.
متن کاملStatistical Properties of Optimal Paths
We study the statistical properties of optimal paths in weighted complex networks with general distribution of weights. We find a general criterion for the strength of disorder and show the relation of optimal paths properties to percolation, in both strong and weak disorder limits. Transport in weighted networks is dominated by the minimum spanning tree (MST), the tree connecting all nodes wit...
متن کاملA graph search algorithm: Optimal placement of passive harmonic filters in a power system
The harmonic in distribution systems becomes an important problem due to an increase in nonlinear loads. This paper presents a new approach based on a graph algorithm for optimum placement of passive harmonic filters in a multi-bus system, which suffers from harmonic current sources. The objective of this paper is to minimize the network loss, the cost of the filter and the total harmonic disto...
متن کاملTypical Paths of a Graph
We introduce (finite and infinite) typical paths of a graph and prove that the typical paths carry all information with probability 1, asymptotically. An automata-theoretic characterization of the typical paths is shown: finite typical paths can be accepted by reversal-bounded multicounter automata and infinite typical paths can be accepted by counting Büchi automata (a generalization of revers...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2005
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2005.04.011